Although certain NP-complete problems stay hard even on average input,
some NP-complete problems are only hard in rare cases. Such NP-complete problems can provably be resolved very quickly on average case under some probability distributions over all possible inputs.
**1. What is the average case of a real-world graph ? **
**2. How to properly define a suitable probability distribution for real-world graphs ? **
Although certain NP-complete problems stay hard even on average input,
some NP-complete problems are only hard in rare cases. Such NP-complete problems can provably be resolved very quickly on average case under some probability distributions over all possible inputs.
**1. What is the average case of a real-world graph ? **
**2. How to properly define a suitable probability distribution for real-world graphs ? **
Continuing the series of articles (... well actually is just the second one) on restricted combinatorial objects constrained by a recursively defined statistic and initiated by [this work](https://papers-gamma.link/paper/38/Dyck%20paths%20with%20a%20first%20return%20decomposition%20constrained%20by%20height) we submitted to review a new paper of subject.
Continuing the series of articles (... well actually is just the second one) on restricted combinatorial objects constrained by a recursively defined statistic and initiated by [this work](https://papers-gamma.link/paper/38/Dyck%20paths%20with%20a%20first%20return%20decomposition%20constrained%20by%20height) we submitted to review a new paper of subject.
[Rob Pike](http://www.herpolhode.com/rob/) complains about software systems research.
A decade later he designed the [go](https://en.wikipedia.org/wiki/Go_(game) language together with Robert Griesemer and Ken Thompson.
[Rob Pike](http://www.herpolhode.com/rob/) complains about software systems research.
A decade later he designed the [go](https://en.wikipedia.org/wiki/Go_(game) language together with Robert Griesemer and Ken Thompson.
Comments: